@Article{Trifonov2012,
  author   = {P. Trifonov},
  title    = {Efficient Design and Decoding of Polar Codes},
  journal  = {IEEE Transactions on Communications (TCOM)},
  year     = {2012},
  volume   = {60},
  number   = {11},
  pages    = {3221--3227},
  month    = nov,
  issn     = {0090-6778},
  abstract = {Polar codes are shown to be instances of both generalized concatenated codes and multilevel codes. It is shown that the performance of a polar code can be improved by representing it as a multilevel code and applying the multistage decoding algorithm with maximum likelihood decoding of outer codes. Additional performance improvement is obtained by replacing polar outer codes with other ones with better error correction performance. In some cases this also results in complexity reduction. It is shown that Gaussian approximation for density evolution enables one to accurately predict the performance of polar codes and concatenated codes based on them.},
  doi      = {10.1109/TCOMM.2012.081512.110872},
  file     = {:pdf/Trifonov2012 - Efficient Design and Decoding of Polar Codes.pdf:PDF},
  groups   = {Polar Codes},
  keywords = {Gaussian processes, concatenated codes, design, maximum likelihood decoding, Gaussian approximation, concatenated codes, density evolution, design, maximum likelihood decoding, multilevel codes, multistage decoding algorithm, polar codes, Approximation algorithms, Concatenated codes, Constellation diagram, Error probability, Maximum likelihood decoding, Vectors, Polar codes, concatenated codes, multilevel codes},
}